package J5_19;

import java.util.Arrays;
import java.util.Deque;
import java.util.PriorityQueue;
import java.util.Scanner;

public class test {
    public static void main1(String[] args) {
        Scanner in = new Scanner(System.in);
        int n = in.nextInt(), k = in.nextInt();
        PriorityQueue<Long> arr = new PriorityQueue<>();
        for (int i = 0; i < n; i++) {
            arr.offer(in.nextLong());
        }
        int res = 0;
        while(k > 0) {
            long t = arr.poll();
            k -= t;
            arr.offer(t*2);
            if (k > 0) {
                res++;
            }
        }
        System.out.println(res);

    }

    public static void main2(String[] args) {
        Scanner in = new Scanner(System.in);
        int t = in.nextInt();
        while (t-- > 0) {
            int n = in.nextInt();
            long  a = in.nextLong(), b = in.nextLong();
            long res = getRes(n,a,b);
            System.out.println(res);
        }
    }

    private static long getRes(int n, long a, long b) {
        long ret1 = n / 2 * a + Math.min(a,b) * (n % 2 > 0 ? 1 : 0);
        long ret2 = n / 3 * b + Math.min(a,b) * (n % 3 > 0 ? 1 : 0);
        return Math.min(ret1, ret2);
    }
    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        String str = in.next();
        int sum = 0;
        int[] arr = new int[str.length()];
        for (int i = 0; i < str.length(); i++) {
            int t = str.charAt(i) - '0';
            sum += t;
            arr[i] = t;
        }
        if (sum % 2 != 0) {
            System.out.println("No");
            return;
        }
        Arrays.sort(arr);
        int tmp = sum / 2, cur = 0;
        boolean[][] dp = new boolean[arr.length + 1][tmp + 1];
        for (int i = 0; i <= arr.length; i++) {
            dp[i][0] = true;
        }
        for (int i = 1; i <= arr.length; i++) {
            for (int j = 1; j <= tmp; j++) {
                if (arr[i-1] > j) {
                    dp[i][j] = dp[i-1][j];
                } else {
                    dp[i][j] = dp[i-1][j-arr[i-1]] || dp[i-1][j];
                }
            }
        }
        if (dp[arr.length][tmp]) {
            System.out.println("Yes");
        } else {
            System.out.println("No");
        }
    }
}
